On the b-Stable Set Polytope of Graphs without Bad K4

نویسندگان

  • Dion Gijswijt
  • Alexander Schrijver
چکیده

We prove that for a graph G = (V,E) without bad K4 subdivision, and for b ∈ Z ∪E + , the b-stable set polytope is determined by the system of constraints determined by the vertices, edges and odd circuits. We also prove that this system is totally dual integral. This relates to t-perfect graphs. Let G = (V,E) be a graph and let b ∈ ZV ∪E + . Then a b-stable set in G is a vector x ∈ Z+ satisfying xv ≤ bv for every vertex v and xu + xv ≤ buv for every edge uv. The b-stable set polytope of G is defined as the convex hull of the b-stable sets in G. We will use the following notation. For sets B ⊆ A and a vector x ∈ RA, let χB be the characteristic vector of B and let x(B) := xTχB. For an edge {u, v} we will use the shorthand notation uv. The vectors in the b-stable set polytope obviously satisfy the following system of inequalities. (i) 0 ≤ xv ≤ bv for each v ∈ V ; (1) (ii) xu + xv ≤ buv for each edge uv ∈ E; (iii) x(V C) ≤ b 2b(EC)c for each odd circuit C. We call a graph G t-perfect with respect to b if the b-stable set polytope is determined by (1). Since each integral vector satisfying (1) is a b-stable set, the polytope determined by (1) equals the b-stable set polytope if and only if it is integral. We call a graph G strongly t-perfect with respect to b if system (1) is totally dual integral. For any weight function w ∈ Z+ and any b ∈ ZV ∪E + , denote by α(G, b, w) the maximum w-weight wTx of a b-stable set x in G. Define a w-cover as a family of vertices, edges and odd circuits in G that covers each vertex v at least wv times. The b-cost of a w-cover is defined as the sum of the costs of its elements, where the cost of a vertex v equals bv, the cost of an edge e equals be and the cost of an odd circuit C equals b 2b(EC)c. Denote by ∗Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands ([email protected]). †CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, and Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands ([email protected]).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong T-Perfection of Bad-K4-Free Graphs

Abstract. We show that each graph not containing a bad subdivision of K4 as a subgraph, is strongly t-perfect. Here a graph G = (V, E) is strongly t-perfect if for each weight function w : V → Z+, the maximum weight of a stable set is equal to the minimum (total) cost of a family of vertices, edges, and circuits covering any vertex v at least w(v) times. By definition, the cost of a vertex or e...

متن کامل

Coloring planar Toeplitz graphs and the stable set polytope

Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...

متن کامل

On the Stable Set Polytope of Claw-Free Graphs

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...

متن کامل

On facets of stable set polytopes of claw-free graphs with stability number three

Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a breakthrough for the subclass of quasi-line graphs. As a consequence, every non-trivial facet of their stable set polytope is of the form k ∑ v∈V1 xv+(k+1) ∑ v∈V2 xv ≤ b for some positive integers k and b, and non-empty...

متن کامل

-λ coloring of graphs and Conjecture Δ ^ 2

For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2003